|
In the mathematical fields of graph theory and combinatorics, a matching polynomial (sometimes called an acyclic polynomial) is a generating function of the numbers of matchings of various sizes in a graph. ==Definition== Several different types of matching polynomials have been defined. Let ''G'' be a graph with ''n'' vertices and let ''mk'' be the number of ''k''-edge matchings. One matching polynomial of ''G'' is : Another definition gives the matching polynomial as : A third definition is the polynomial : Each type has its uses, and all are equivalent by simple transformations. For instance, : and : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Matching polynomial」の詳細全文を読む スポンサード リンク
|